Grilliot's trick in Nonstandard Analysis
نویسنده
چکیده
Recently, Dag Normann and the author have established a connection between higher-order computability theory and Nonstandard Analysis; new results in both fields are obtained by exploiting this connection ([28]). Now, on the side of computability theory, the technique known as Grilliot’s trick constitutes a template for explicitly defining the Turing jump functional (∃) in terms of a given effectively discontinuous type two functional ([14]). In light of the aforementioned connection, it is a natural question what corresponds to Grilliot’s trick in Nonstandard Analysis? In this paper, we discuss the nonstandard extensionality trick : a technique similar to Grilliot’s trick in Nonstandard Analysis. This nonstandard trick proceeds by deriving from the existence of certain nonstandard discontinuous functionals, the Transfer principle from Nonstandard analysis limited to Π01-formulas; from this (generally ineffective) implication, we obtain an effective implication expressing the Turing jump functional in terms of a discontinuous functional (and no longer involving Nonstandard Analysis). The advantage of our nonstandard approach is that one obtains effective content without paying attention to effective content. We also discuss a new class of functionals which fall outside the established categories. These functionals derive from the Standard Part axiom of Nonstandard Analysis.
منابع مشابه
A New Approach to Nonstandard Analysis
In this paper, we propose a new approach to nonstandard analysis without using the ultrafilters. This method is very simple in practice. Moreover, we construct explicitly the total order relation in the new field of the infinitesimal numbers. To illustrate the importance of this work, we suggest comparing a few applications of this approach with the former methods.
متن کاملoes T he T rick ( R evised V ersion ) BRICS Basic Research in Computer Science Eta - Expansion Does The Trick ( Revised
Partial-evaluation folklore has it that massaging one’s source programs can make them specialize better. In Jones, Gomard, and Sestoft’s recent textbook, a whole chapter is dedicated to listing such “binding-time improvements”: nonstandard use of continuationpassing style, eta-expansion, and a popular transformation called “The Trick”. We provide a unified view of these binding-time improvement...
متن کاملNonstandard finite difference schemes for differential equations
In this paper, the reorganization of the denominator of the discrete derivative and nonlocal approximation of nonlinear terms are used in the design of nonstandard finite difference schemes (NSFDs). Numerical examples confirming then efficiency of schemes, for some differential equations are provided. In order to illustrate the accuracy of the new NSFDs, the numerical results are compared with ...
متن کاملThe Numerical Solution of Klein-Gorden Equation by Using Nonstandard Finite Difference
In this paper we propose a numerical scheme to solve the one dimensional nonlinear Klein-Gorden equation. We describe the mathematical formulation procedure in details. The scheme is three level explicit and based on nonstandard finite difference. It has nonlinear denominator function of the step sizes. Stability analysis of the method has been given and we prove that the proposed meth...
متن کاملA numerical method for discrete fractional--order chemostat model derived from nonstandard numerical scheme
In this paper, the fractional--order form of three dimensional chemostat model with variable yields is introduced. The stability analysis of this fractional system is discussed in detail. In order to study the dynamic behaviours of the mentioned fractional system, the well known nonstandard (NSFD) scheme is implemented. The proposed NSFD scheme is compared with the forward Euler and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logical Methods in Computer Science
دوره 13 شماره
صفحات -
تاریخ انتشار 2017